Approximation algorithms and decision making in the Dempster-Shafer theory of evidence - An empirical study

The computational complexity of reasoning within the Dempster-Shafer theory of evidence is one of the major points of criticism this formalism has to face. To overcome this diiculty various approximation algorithms have been suggested that aim at reducing the number of focal elements in the belief functions involved. This article reviews a number of algorithms based on this method and introduces a new one|the D1 algorithm|that was designed to bring about minimal deviations in those values that are relevant to decision making. It describes an empirical study that examines the appropriateness of these approximation procedures in decision-making situations. It presents and interprets the empirical ndings along several dimensions and discusses the various tradeoos that have to be taken into account when actually applying one of these methods. 2